Erratum: Enumerating Typical Circulant Covering Projections onto a Circulant Graph

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumerating typical abelian prime-fold coverings of a circulant graph

Enumerating the isomorphism classes of several types of graph coverings is one of the central research topics in enumerative topological graph theory (see [R. Feng, J.H. Kwak, J. Kim, J. Lee, Isomorphism classes of concrete graph coverings, SIAM J. Discrete Math. 11 (1998) 265–272; R. Feng, J.H. Kwak, Typical circulant double coverings of a circulant graph, Discrete Math. 277 (2004) 73–85; R. F...

متن کامل

Typical circulant double coverings of a circulant graph

Several isomorphism classes of graph coverings of a graph G have been enumerated by many authors. Kwak and Lee (Canad. J. Math. XLII (1990) 747) enumerated the isomorphism classes of graph bundles and those of n-fold coverings with respect to a group of automorphisms of the base graph G which 9x a spanning tree. Hofmeister (Discrete Math. 98 (1991) 175) independently enumerated the isomorphism ...

متن کامل

Fast Neural Networks with Circulant Projections

The basic computation of a fully-connected neural network layer is a linear projection of the input signal followed by a non-linear transformation. The linear projection step consumes the bulk of the processing time and memory footprint. In this work, we propose to replace the conventional linear projection with the circulant projection. The circulant structure enables the use of the Fast Fouri...

متن کامل

Additive circulant graph codes over GF ( 4 )

In this paper we consider additive circulant graph codes over GF(4) and an algorithm for their construction. Also, we present some new results obtained by

متن کامل

On circulant and two-circulant weighing matrices

We employ theoretical and computational techniques to construct new weighing matrices constructed from two circulants. In particular, we construct W (148, 144), W (152, 144), W (156, 144) which are listed as open in the second edition of the Handbook of Combinatorial Designs. We also fill a missing entry in Strassler’s table with answer ”YES”, by constructing a circulant weighing matrix of orde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Discrete Mathematics

سال: 2007

ISSN: 0895-4801,1095-7146

DOI: 10.1137/060653020